Enumeration and limit laws of dissections on a cylinder
نویسنده
چکیده
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different faces is either empty, a vertex or an edge. We generalize these results to maps with either constant ({k}-dissections) or unrestricted (unrestricted dissections) face degree. We apply singularity analysis to the resulting generating functions to obtain asymptotic estimates for their coefficients, as well as limit distributions for natural parameters.
منابع مشابه
Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations
This paper describes a systematic approach to the enumeration of \non-crossing" geometric conngurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. A consequence is exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Limit la...
متن کاملAnalytic Combinatorics of Non-crossing Conngurations
This paper describes a systematic approach to the enumeration of \non-crossing" geometric conngurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. A consequence is exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Limit la...
متن کاملAnalytic combinatorics of non-crossing configurations
This paper describes a systematic approach to the enumeration of 'non-crossing' geometric configurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. Consequences are both exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Li...
متن کاملAnalytic Combinatorics of Chord Diagrams Analytic Combinatorics of Chord Diagrams Combinatoire Analytique Des Diagrammes De Cordes Analytic Combinatorics of Chord Diagrams
In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings. Key-words: Analytic combinatorics, c...
متن کاملCounting polygon dissections in the projective plane
For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) on the number of triangulations of the Möbius band having n labelled points on its boundary. We also solve the problem when the polygon is dissected into subpolygons of arbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010